Iterative and Direct Sparse Solvers on Parallel Computers
نویسندگان
چکیده
Solving large sparse systems of linear equations is required for a wide range of numerical applications. This paper addresses the main issues raised during the parallelization of iterative and direct solvers for such systems in distributed memory multiprocessors. If no preconditioning is considered, iterative solvers are simple to parallelize, as the most time-consuming computational structures are matrix{ vector products. Direct methods are much harder to parallelize, as new nonzero values may appear during computation and pivoting operations are usually accomplished due to numerical stability considerations. Suitable data structures and distributionsfor sparse solvers are discussed within the framework of a data-parallel environment, and experimentally evaluated and compared with existing solutions.
منابع مشابه
Factorization-based Sparse Solvers and Preconditioners
Efficient solution of large-scale, ill-conditioned and highly-indefinite algebraic equations often relies on high quality preconditioners together with iterative solvers. Because of their robustness, factorizationbased algorithms play a significant role in developing scalable solvers. We discuss the state-of-the-art, high performance sparse factorization techniques which are used to build spars...
متن کاملComparison of Direct and Iterative Sparse Linear Solvers for Power System Applications on Parallel Computing Platforms
This paper presents a performance comparison of sparse linear solvers based on iterative and direct methods for power system applications implemented on parallel computing platform. The iterative sparse linear solver evaluated in this paper is based on the conjugate gradient algorithm with a Jacobi pre-conditioner executed on a general purpose graphic processing unit (GPGPU). The direct solvers...
متن کاملA Brief Introduction to Krylov Space Methods for Solving Linear Systems
With respect to the " influence on the development and practice of science and engineering in the 20th century " , Krylov space methods are considered as one of the ten most important classes of numerical methods [1]. Large sparse linear systems of equations or large sparse matrix eigenvalue problems appear in most applications of scientific computing. Sparsity means that most elements of the m...
متن کاملA domain-decomposing parallel sparse linear system solver
The solution of large sparse linear systems is often the most time-consuming part of many science and engineering applications. Computational fluid dynamics, circuit simulation, power network analysis, and material science are just a few examples of the application areas in which large sparse linear systems need to be solved effectively. In this paper we introduce a new parallel hybrid sparse l...
متن کاملPSPIKE: A Parallel Hybrid Sparse Linear System Solver
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse linear system solvers. These solvers must optimize parallel performance, processor (serial) performance, as well as memory requirements, while being robust across broad classes of applications and systems. In this paper, ...
متن کامل